Vehicle Routing Problem Considering Reconnaissance and Transportation

Troop movement involves transporting military personnel from one location to another using available means. To minimize damage enemies, the simultaneously uses reconnaissance and transportation units during troop movements. This paper proposes a vehicle routing problem considering (VRPCRT) for wartime The VRPCRT is formulated as mixed-integer programming model minimizing completion time of movements reconnaissance, routes were determined in VRPCRT. For this paper, an ant colony optimization (ACO) algorithm was also developed, computational experiments conducted compare ACO algorithm’s performance that model. shown yield excellent results even real-size problem. Furthermore, sensitivity analysis change number vehicles performed, effects each type on analyzed.